Optimization Problems on Threshold Graphs
نویسندگان
چکیده
During the last three decades, different types of decompositions have been processed in the field of graph theory. Among these we mention: decompositions based on the additivity of some characteristics of the graph, decompositions where the adjacency law between the subsets of the partition is known, decompositions where the subgraph induced by every subset of the partition must have predeterminate properties, as well as combinations of such decompositions. In this paper we characterize threshold graphs using the weakly decomposition, determine: density and stability number, Wiener index and Wiener polynomial for threshold graphs.
منابع مشابه
Extremal optimization of graph partitioning at the percolation threshold
The benefits of a recently proposed method to approximate hard optimization problems are demonstrated on the graph partitioning problem. The performance of this new method, called extremal optimization (EO), is compared with simulated annealing (SA) in extensive numerical simulations. While generally a complex (NP-hard) problem, the optimization of the graph partitions is particularly difficult...
متن کاملParallel algorithms for Hamiltonian problems on quasi-threshold graphs
In this paper we show structural and algorithmic properties on the class of quasi-threshold graphs, or QT-graphs for short, and prove necessary and sufficient conditions for a QT-graph to be Hamiltonian. Based on these properties and conditions, we construct an efficient parallel algorithm for finding a Hamiltonian cycle in a QT-graph; for an input graph on n vertices and m edges, our algorithm...
متن کاملSub–optimality of local algorithms on sparse random graphs by
Sub–optimality of local algorithms on sparse random graphs Mustazee Rahman Doctor of Philosophy Graduate Department of Mathematics University of Toronto 2015 This thesis studies local algorithms for solving combinatorial optimization problems on large, sparse random graphs. Local algorithms are randomized algorithms that run in parallel at each vertex of a graph by using only local information ...
متن کاملA New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs
Kolla and Tulsiani (2007, 2011) and Arora, Barak and Steurer (2010) introduced the technique of subspace enumeration, which gives approximation algorithms for graph problems such as unique games and small set expansion; the running time of such algorithms is exponential in the threshold rank of the graph. Guruswami and Sinop (2011, 2012) and Barak, Raghavendra, and Steurer (2011) developed an a...
متن کاملApplication of n-distance balanced graphs in distributing management and finding optimal logistical hubs
Optimization and reduction of costs in management of distribution and transportation of commodity are one of the main goals of many organizations. Using suitable models in supply chain in order to increase efficiency and appropriate location for support centers in logistical networks is highly important for planners and managers. Graph modeling can be used to analyze these problems and many oth...
متن کامل